Primitive representations of the polycyclic monoids and branching function systems

نویسنده

  • Mark V. Lawson
چکیده

We generalise the group theoretic notion of a primitive permutation representation to inverse monoids and so obtain a notion of a primitive representation by partial permutations. Such representations are shown to be determined by what we call essentially maximal proper closed inverse submonoids. Such submonoids in the case of the polycyclic inverse monoids (also known as Cuntz inverse semigroups) are characterised and all primitive representations of the polycyclic monoids determined. We relate our results to the work of Kawamura on certain kinds of representations of the Cuntz C∗-algebras and to the branching function systems of Bratteli and Jorgensen. 2000 Mathematics Subject Classification: 20M18, 20M30, 46L05, 20B15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Primitive partial permutation representations of the polycyclic monoids and branching function systems

We characterise the maximal proper closed inverse submonoids of the polycyclic inverse monoids, also known as Cuntz inverse semigroups, and so determine all their primitive partial permutation representations. We relate our results to the work of Kawamura on certain kinds of representations of the Cuntz C∗-algebras and to the branching function systems of Bratteli and Jorgensen.

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

ar X iv : 0 71 0 . 37 11 v 1 [ m at h . R A ] 1 9 O ct 2 00 7

We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or more, such automata accept exactly the context-free languages. For the polycyclic monoid of rank 1 (that is...

متن کامل

Dilations‎, ‎models‎, ‎scattering and spectral problems of 1D discrete Hamiltonian systems

In this paper, the maximal dissipative extensions of a symmetric singular 1D discrete Hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the Hilbert space ℓ_{Ω}²(Z;C²) (Z:={0,±1,±2,...}) are considered. We consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. For each of these cases we establish a self...

متن کامل

A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)

One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008